User initiated replication in a synchronized object replication system

ABSTRACT

A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. One of the selected objects is retrieved in an ordered manner from the snapshot. An object identification (ID) and a state ID are sent to the target destination and used to locate and compare the selected object with a current state of the selected object in the target destination.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No.13/489,383, filed Jun. 5, 2012, the entirety of which is herebyincorporated by reference.

BACKGROUND OF THE INVENTION

Field of the Invention

The present invention relates generally to computers, and moreparticularly, to user initiated replication in a synchronized objectreplication system.

Description of the Related Art

In today's society, computer systems are commonplace. Computer systemsmay be found in the workplace, at home, or at school. Computer systemsmay include data storage systems, or disk storage systems, to processand store data. One such process is data replication. Replicated datasystems may externalize various logical data storage entities, such asfiles, data objects, backup images, data snapshots or virtual tapecartridges. It is often required that such data storage entities bereplicated from their origin site to remote sites. Replicated dataentities enhance fault tolerance abilities and availability of data.While several existing approaches may be used to perform datareplication, these approaches have accompanying limitations thatnegatively affect replication efficiency, system performance and dataconsistency, require additional overhead, or any combination of theabove challenges.

SUMMARY OF THE INVENTION

Data replication involves the backing up of data stored at a primarysite by storing the exact duplicate of the data on a secondary or remotesite. Using data replication processes provide a variety of benefits.Data replication has emerged in recent years as a highly importanttechnological field in computing storage systems. Challenges toproviding data replication functionality exist in synchronizedreplication system where it is required that there are strict relationsbetween objects, such that object A with state X requires that object Bhas state Y. In synchronized replication systems, when establishing anew replication context between the source and destination or adding anadditional set of objects to the context, there is a state ofin-synchronization as only new operations on the objects are sent to thedestination. Thus, it is required to initiate replication of theunsynchronized objects in their current state.

As such, a need exists for a solution allowing for a user initiatedreplication process in a synchronized object replication system. Also, aneed exists for performing the user-initiated replication of theunsynchronized objects without being disruptive to creation andmanipulation of the objects at the source repository while avoidingviolating the normal order of replication for new operations in thesource. In addition, a need exists allowing for a user to initiate thereplication of a set of objects, regardless of the set of objects'synchronization state, for efficiently detecting the objects thatrequire replication, and limiting the replication to the detectedobjects requiring replication.

Accordingly, and in view of the foregoing, various embodiments foruser-initiated replication in a synchronized object replication systemin a computing environment are provided. In one embodiment, by way ofexample only, a system is provided for creating a snapshot of selectedobjects in a source repository in response to the user initiatedreplication, wherein the snapshot is designated as a snapshotreplication job, detecting unsynchronized objects in a targetdestination by comparing a lightweight representative state of theselected objects in the snapshot with a current state of the targetdestination at the time of execution of the snapshot replication job,retrieving in an ordered manner at least one object of the selectedobjects from the snapshot, sending an object identification (ID) and astate ID of the at least one object to the target destination, searchingfor the object ID in the target destination, wherein if the object ID islocated, the state ID of the at least one object is compared with acurrent state ID of the target destination, and if neither the object IDexists in the target destination and the state ID of the at least oneobject and the current state ID of the target destination do not match,replication tasks are opened for replicating data and metadata of the atleast one object to the target destination.

In addition to the foregoing exemplary embodiment, other exemplarysystem and computer product embodiments are provided and supply relatedadvantages. The foregoing summary has been provided to introduce aselection of concepts in a simplified form that are further describedbelow in the Detailed Description. This Summary is not intended toidentify key features or essential features of the claimed subjectmatter, nor is it intended to be used as an aid in determining the scopeof the claimed subject matter. The claimed subject matter is not limitedto implementations that solve any or all disadvantages noted in thebackground.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsthat are illustrated in the appended drawings. Understanding that thesedrawings depict embodiments of the invention and are not therefore to beconsidered to be limiting of its scope, the invention will be describedand explained with additional specificity and detail through the use ofthe accompanying drawings, in which:

FIG. 1 is a block diagram illustrating a computing system environmenthaving an example storage device in which aspects of the presentinvention may be realized;

FIG. 2 is a block diagram illustrating a hardware structure of anexemplary data storage system in a computer system in which aspects ofthe present invention may be realized;

FIG. 3 is a flow chart diagram illustrating an exemplary method for userinitiated replication in a synchronized object replication system; and

FIG. 4 is a flow chart diagram illustrating an exemplary method forexecution of a snapshot replication job.

DETAILED DESCRIPTION OF THE DRAWINGS

Throughout the following description and claimed subject matter, thefollowing terminology, pertaining to the illustrated embodiments, isdescribed. A “Replication context” is intended to refer to auser-defined association between a set of source objects and adestination. All source operations on the set of objects are to bereplicated to the destination. A “Replication job” is intended to referto a task to replicate an object operation in from the source (e.g., asource repository) to a destination (e.g., a target destination). A“Snapshot” is intended to refer to a collaborative state of an objectset at a certain point in time. The snapshot includes the objects' dataand metadata at the time of the snapshot creation. The snapshotmaintains the state of the objects even if they are changed or deleted.A “Replication Queue” is intended to refer to a queue that holds thereplication jobs that are pending execution. The replication queue is astrict first-in-first-out queue, such that the replication jobs areperformed in the destination (e.g., target destination) at the exactorder in which they happened in the source (e.g., source repository). A“system” may include a computer system, a computer processor, a primarystorage system, a remote storage system or any other component within acomputer environment needed to carry out the claimed invention.

An “Object unique ID” is intended to refer to an attribute of theobject, uniquely identifying the object within the group of replicationsystems. An “Object state ID” is intended to refer to an attribute ofthe object state, identifying the state of the object. The object stateID is unique for a certain state of an object and changes when theobject data or metadata changes. A “Replication engine” is intended torefer to the module responsible for the physical replication of data. A“Replication task” is intended to refer to a request to the replicationengine, to perform the physical replication of the object data ormetadata.

As mentioned above, data replication involves the backing up of datastored at a primary site by storing the exact duplicate of the data on asecondary or remote site. Moreover, object replication is the method ofreplicating objects at a logical level rather than replicating at astorage block level. Similar to block-level storage replication, objectreplication can be either synchronized or unsynchronized. Insynchronized mode, every operation on the objects at the sourcerepository is mirrored to the destination repository. The operations areperformed in the destination at the same order in which they wereperformed in the source. While in unsynchronized mode, there is norequirement to perform the operations in order, but merely to maintainsome stable state of the objects in the destination. A synchronizedreplication system is required when there are strict relations betweenthe objects, such that object A with state X requires that object B hasstate Y. For example, in synchronized replication systems,sub-directories and/or files rely on parent directories.

In such systems, when establishing a new replication context between thesource and destination or adding an additional set of objects to thecontext, there is a state of in-synchronization as only new operationson the objects are sent to the destination. Thus, it is required toinitiate replication of the unsynchronized objects in their currentstate.

As such, a need exists for a solution allowing for a user initiatedreplication process in a synchronized object replication system. Also, aneed exists for performing the user-initiated replication of theunsynchronized objects without being disruptive to creation andmanipulation of the objects at the source repository while avoidingviolating the normal order of replication for new operations in thesource. In addition, a need exists allowing for a user to initiate thereplication of a set of objects, regardless of the set of objects'synchronization state, for efficiently detecting the objects thatrequire replication, and limiting the replication to the detectedobjects requiring replication.

To address these needs, the mechanisms of the illustrated embodimentsseek to provide a solution allowing for a user initiated replication ofthe unsynchronized objects that is non disruptive to creation andmanipulation of the objects at the source repository without violatingthe normal order of replication of new operations in the source. In oneembodiment, by way of example only, the mechanisms provide auser-initiated replication of a set of objects, regardless of the set ofobjects synchronization state, efficiently detect the objects thatrequire replication, and limit the replication to only to the detectedobjects requiring replication.

Moreover, by way of example only, the mechanisms of the presentinvention provide for a scalable and efficient user initiatedreplication in a synchronized object replication system that satisfiesthe following essential requirements. 1) The mechanisms allow the userto perform replication of a set of objects, independent of their actualsynchronization state. 2) The mechanisms efficiently detect theunsynchronized objects, which require replication. 3) The mechanisms donot disrupt the local creation, deletion and manipulation of objects. 4)The mechanisms will not compromise the normal replication order of thesource operations. 5) The mechanisms all for the user initiatedreplication of a set of objects independent of the actual replicationprocedures.

The mechanisms of the present invention accomplish each of these factorsregardless of the system size and number of objects. Moreover, themechanisms of the present invention enable initiation of replication fora set of objects, regardless of their synchronization state, whilstremaining independent of the replication procedures, protocol and/orfile-system layout, representation and implementation.

In one embodiment, by way of example only, the synchronous objectreplication operations of the present invention may be simply describedby the addition of new source operations under the replication contextas replication jobs to the end of the replication queue in the order inwhich they occur. The mechanisms execute the jobs by taking a job fromthe head of the replication queue and performing the source operationthe replication job describes in the destination. As the replicationjobs are added to the replication queue in the order in which they occurin the source, and are performed sequentially, the replication jobsoccur in the destination at the exact order in which they occurred inthe source.

Because the synchronous object replication mechanism only performsreplication of new operations on the objects, when creating thereplication context or when adding additional objects to it, theseobjects do not exist in the destination and are consideredunsynchronized. As such, the mechanisms for the present inventionprovide for a solution that enables scalable and efficient replicationinitiation of an object set within the basic replication flow, whichallows replication of the objects regardless of their synchronizationstate.

In one embodiment, upon replication initiation on an object set by auser, the mechanisms create a snapshot of the selected object set. Themechanisms assume that the underlying objects layout and representationsupports a time efficient snapshot creation process. Moreover, themechanisms assume that the snapshot creation process is not disruptiveto other local object operations. The snapshot is then added to the endof the replication queue as a new replication job. The synchronousreplication mechanisms ensure the execution of the replication jobs inthe exact order the replication jobs occurred, all operations thatoccurred before the snapshot creation are sure to be replicated beforethe snapshot replication job is replicated, and all operations thatoccurred after the snapshot replication creation are to be replicatedafter the snapshot replication.

Turning now to FIG. 1, exemplary architecture 10 of a computing systemenvironment is depicted. The computer system 10 includes centralprocessing unit (CPU) 12, which is connected to communication port 18and memory device 16. The communication port 18 is in communication witha communication network 20. The communication network 20 and storagenetwork may be configured to be in communication with server (hosts) 24and 22 and storage systems, which may include storage devices 14. Thestorage systems may include hard disk drive (HDD) devices, solid-statedevices (SSD) etc., which may be configured in a redundant array ofindependent disks (RAID). The operations as described below may beexecuted on storage device(s) 14, located in system 10 or elsewhere andmay have multiple memory devices 16 working independently and/or inconjunction with other CPU devices 12. Memory device 16 may include suchmemory as electrically erasable programmable read only memory (EEPROM)or a host of related devices. Memory device 16 and storage devices 14are connected to CPU 12 via a signal-bearing medium. In addition, CPU 12is connected through communication port 18 to a communication network20, having an attached plurality of additional computer host systems 24and 22. In addition, memory device 16 and the CPU 12 may be embedded andincluded in each component of the computing system 10. Each storagesystem may also include separate and/or distinct memory devices 16 andCPU 12 that work in conjunction or as a separate memory device 16 and/orCPU 12.

FIG. 2 is an exemplary block diagram 200 showing a hardware structure ofa data storage system in a computer system according to the presentinvention. Host computers 210, 220, 225, are shown, each acting as acentral processing unit for performing data processing as part of a datastorage system 200. The cluster hosts/nodes (physical or virtualdevices), 210, 220, and 225 may be one or more new physical devices orlogical devices to accomplish the purposes of the present invention inthe data storage system 200. In one embodiment, by way of example only,a data storage system 200 may be implemented as IBM® System Storage™DS8000™. A Network connection 260 may be a fibre channel fabric, a fibrechannel point to point link, a fibre channel over ethernet fabric orpoint to point link, a FICON or ESCON I/O interface, any other I/Ointerface type, a wireless network, a wired network, a LAN, a WAN,heterogeneous, homogeneous, public (i.e. the Internet), private, or anycombination thereof. The hosts, 210, 220, and 225 may be local ordistributed among one or more locations and may be equipped with anytype of fabric (or fabric channel) (not shown in FIG. 2) or networkadapter 260 to the storage controller 240, such as Fibre channel, FICON,ESCON, Ethernet, fiber optic, wireless, or coaxial adapters. Datastorage system 200 is accordingly equipped with a suitable fabric (notshown in FIG. 2) or network adapter 260 to communicate. Data storagesystem 200 is depicted in FIG. 2 comprising storage controllers 240 andcluster hosts 210, 220, and 225. The cluster hosts 210, 220, and 225 mayinclude cluster nodes.

To facilitate a clearer understanding of the methods described herein,storage controller 240 is shown in FIG. 2 as a single processing unit,including a microprocessor 242, system memory 243 and nonvolatilestorage (“NVS”) 216, which will be described in more detail below. It isnoted that in some embodiments, storage controller 240 is comprised ofmultiple processing units, each with their own processor complex andsystem memory, and interconnected by a dedicated network within datastorage system 200. Storage 230 (labeled as 230 a, 230 b, and 230 n inFIG. 3) may be comprised of one or more storage devices, such as storagearrays, which are connected to storage controller 240 (by a storagenetwork) with one or more cluster hosts 210, 220, and 225 connected toeach storage controller 240.

In some embodiments, the devices included in storage 230 may beconnected in a loop architecture. Storage controller 240 manages storage230 and facilitates the processing of write and read requests intendedfor storage 230. The system memory 243 of storage controller 240 storesprogram instructions and data, which the processor 242 may access forexecuting functions and method steps of the present invention forexecuting and managing storage 230 as described herein. In oneembodiment, system memory 243 includes, is in association with, or is incommunication with the operation software 250 for performing methods andoperations described herein. As shown in FIG. 2, system memory 243 mayalso include or be in communication with a cache 245 for storage 230,also referred to herein as a “cache memory”, for buffering “write data”and “read data”, which respectively refer to write/read requests andtheir associated data. In one embodiment, cache 245 is allocated in adevice external to system memory 243, yet remains accessible bymicroprocessor 242 and may serve to provide additional security againstdata loss, in addition to carrying out the operations as described inherein.

In some embodiments, cache 245 is implemented with a volatile memory andnon-volatile memory and coupled to microprocessor 242 via a local bus(not shown in FIG. 2) for enhanced performance of data storage system200. The NVS 216 included in data storage controller is accessible bymicroprocessor 242 and serves to provide additional support foroperations and execution of the present invention as described in otherfigures. The NVS 216, may also referred to as a “persistent” cache, or“cache memory” and is implemented with nonvolatile memory that may ormay not utilize external power to retain data stored therein. The NVSmay be stored in and with the cache 245 for any purposes suited toaccomplish the objectives of the present invention. In some embodiments,a backup power source (not shown in FIG. 2), such as a battery, suppliesNVS 216 with sufficient power to retain the data stored therein in caseof power loss to data storage system 200. In certain embodiments, thecapacity of NVS 216 is less than or equal to the total capacity of cache245.

Storage 230 may be physically comprised of one or more storage devices,such as storage arrays. A storage array is a logical grouping ofindividual storage devices, such as a hard disk. In certain embodiments,storage 230 is comprised of a JBOD (Just a Bunch of Disks) array or aRAID (Redundant Array of Independent Disks) array. A collection ofphysical storage arrays may be further combined to form a rank, whichdissociates the physical storage from the logical configuration. Thestorage space in a rank may be allocated into logical volumes, whichdefine the storage location specified in a write/read request.

In one embodiment, by way of example only, the storage system as shownin FIG. 2 may include a logical volume, or simply “volume,” may havedifferent kinds of allocations. Storage 230 a, 230 b and 230 n are shownas ranks in data storage system 200, and are referred to herein as rank230 a, 230 b and 230 n. Ranks may be local to data storage system 200,or may be located at a physically remote location. In other words, alocal storage controller may connect with a remote storage controllerand manage storage at the remote location. Rank 230 a is shownconfigured with two entire volumes, 234 and 236, as well as one partialvolume 232 a. Rank 230 b is shown with another partial volume 232 b.Thus volume 232 is allocated across ranks 230 a and 230 b. Rank 230 n isshown as being fully allocated to volume 238—that is, rank 230 n refersto the entire physical storage for volume 238. From the above examples,it will be appreciated that a rank may be configured to include one ormore partial and/or entire volumes. Volumes and ranks may further bedivided into so-called “tracks,” which represent a fixed block ofstorage. A track is therefore associated with a given volume and may begiven a given rank.

The storage controller 240 may include a user initiated replicationmodule 255, replication engine module 257, and snapshot module 259. Theuser initiated replication module 255, replication engine module 257,and snapshot module 259 may work in conjunction with each and everycomponent of the storage controller 240, the hosts 210, 220, 225, andstorage devices 230. The user initiated replication module 255,replication engine module 257, and snapshot module 259 may bestructurally one complete module or may be associated and/or includedwith other individual modules. The user initiated replication module255, replication engine module 257, and snapshot module 259 may also belocated in the cache 245 or other components.

The storage controller 240 includes a control switch 241 for controllingthe fiber channel protocol to the host computers 210, 220, 225, amicroprocessor 242 for controlling all the storage controller 240, anonvolatile control memory 243 for storing a microprogram (operationsoftware) 250 for controlling the operation of storage controller 240,data for control and each table described later, cache 245 fortemporarily storing (buffering) data, and buffers 244 for assisting thecache 245 to read and write data, a control switch 241 for controlling aprotocol to control data transfer to or from the storage devices 230,user initiated replication module 255, replication engine module 257,and snapshot module 259, in which information may be set. Multiplebuffers 244 may be implemented with the present invention to assist withthe operations as described herein. In one embodiment, the clusterhosts/nodes, 210, 220, 225 and the storage controller 240 are connectedthrough a network adaptor (this could be a fibre channel) 260 as aninterface i.e., via at least one switch called “fabric.”

In one embodiment, the host computers or one or more physical or virtualdevices, 210, 220, 225 and the storage controller 240 are connectedthrough a network adaptor (this could be a fibre channel) 260 as aninterface i.e., via at least one switch called “fabric.” In oneembodiment, the operation of the system shown in FIG. 2 will bedescribed. The microprocessor 242 may control the memory 243 to storecommand information from the host device (physical or virtual) 210 andinformation for identifying the host device (physical or virtual) 210.The control switch 241, the buffers 244, the cache 245, the operatingsoftware 250, the microprocessor 242, memory 243, NVS 216, userinitiated replication module 255, replication engine module 257, andsnapshot module 259 are in communication with each other and may beseparate or one individual component(s). Also, several, if not all ofthe components, such as the operation software 250 may be included withthe memory 243. Each of the components within the devices shown may belinked together and may be in communication with each other for purposessuited to the present invention.

As mentioned above, the user initiated replication module 255,replication engine module 257, and snapshot module 259 may also belocated in the cache 245 or other components. It should be noted thatthe RAM module 259 can be compared to short-term memory and the harddisk to the long-term memory. In other words, the RAM module 259 israndom access memory. The RAM (random access memory) is the place in acomputer where the operating system, application programs, and data incurrent use are kept so that they can be quickly reached by thecomputer's processor 242. The RAM is much faster to read from and writeto than the other kinds of storage in a computer, the hard disk, floppydisk, and CD-ROM. As such, one or more user initiated replication module255, replication engine module 257, and snapshot module 259 may be usedas needed, based upon the storage architecture and user's preferences.

Turning now to FIG. 3, a flowchart illustrating an exemplary method 300for user initiated replication in a synchronized object replicationsystem. The method 300 begins (step 302) by creating a snapshot ofselected objects in a source repository in response to the userinitiated replication (step 304). A snapshot is designated as a snapshotreplication job (step 306). The snapshot replication job is added to theend of a replication queue to await execution for the synchronizedobject replication (step 308). It should be noted that the method 300may use a replication queue by adding the snapshot replication job tothe replication queue in order to replicate a snapshot of the objectsset requested by the user for replication. The state of the selectedobjects in the snapshot is compared with a current state of the targetdestination at the time of execution of the snapshot replication job(step 310). Based upon the comparison, the method 300 will detectunsynchronized objects in a target destination (step 312). Theunsynchronized objects in the target destination are synchronized basedupon the comparing (step 314). The method 300 ends (step 316).

To further illustrate the operations of the present invention, asdescribed in FIG. 3, consider the mechanisms being employed in asynchronous file system replication system. A replication context is theassociation between a source and destination directories. All operationsunder the source directory are to be reflected to the destinationdirectory. An object in this system is a node in the file system tree,e.g. file or a directory. In one embodiment, the object operations aresplit to data and metadata operations. The data operations are eitherthe write operations of new data or the deletion operations of old data.The metadata operations are either a change in a node's metadata or thechange of the tree structure. Such operations are added to thereplication queue in the order in which they occurred and are executedin the destination sequentially. In so doing, the mechanisms ensure thatthe destination always holds a consistent image that once existed in thesource.

Moreover, a replication context may be created when there are alreadyexisting objects in the source. In a file system these may bedirectories with files. For example, the replication context is theconnection between the directory “/a” in the source system and thedirectory “/a” in the destination system. At the time the replicationcontext is created, the directory “/a/b” already exists in the source,including a complex sub-tree under it. As the synchronous replicationmechanism only replicates new operations, the content and structure of“/a/b” will not be replicated unless changed.

A user then goes ahead and creates the new directory, for example“/a/c/”, in the source and creates another sub-tree under it. As thesenew operations are done under the replication context supervision, theyare all added to the replication queue and are scheduled forreplication. At a certain point in time, the user may wish to fullysynchronize “/a” to the destination. The user does this by initiatingreplication on the “/a” directory. As described in FIG. 3, themechanisms create a snapshot of “/a” at the time of initiation and addsit as another replication job to the replication queue.

At the time of initiation, the replication queue may not be empty, whichmeans there are source operations on “/a/c” that have not yet beenreplicated to the destination. In other words, at the time of execution,the destination state of “/a/c” does not match the one in the sourcesnapshot. Because the replication synchronous mechanisms ensure that thereplication jobs are executed in order, the mechanisms ensure that whenthe snapshot replication job is executed, all previous operations on“/a/c” that occurred before its creation have already been replicatedand that no operations on “/a/c” that occurred after the snapshotcreation had been replicated. In other words, this means that at thetime of execution, the destination holds an exact copy of “/a/c” as theone in the snapshot.

Continuing on with the example-scenario, the mechanisms operate bycomparing the objects in the snapshot with the ones in the destination,which does so by traversing the snapshot and comparing the treestructure, data, and metadata with the destination. Moreover, when thetraversing and/or the comparing operations are performed, the mechanismmay discover that all of “/a/c” matches the snapshot and no replicationfor the snapshot is needed. However, all of “/a/b” will be missing inthe destination, so the mechanisms may open replication tasks in thereplication engine for the actual replication of the data and metadatafor all of the nodes in the snapshot under “/a/b”.

The mechanisms wait for all of the replication tasks to complete, andthen, finalize the snapshot replication job and allow the sourceoperations that occurred after it to replicate. In so doing, themechanisms ensure that when the snapshot replication completes, thedestination holds the exact image of “/a” at the time of replicationinitiation by the user. As the snapshot replication did not perform anymanipulations on “/a/c” in the destination, the state of “/a/c” is notaffected and the source operations in the queue for “/a/c” can continueto replicate.

In one embodiment, as may be described below in FIG. 4, the mechanismsallow for a user initiated replication objects set by creating asnapshot for the objects set, creating a new replication job for thesnapshot, and adding the new replication job to the replication queue.The execution of the snapshot replication job is done by performingcomparisons between the objects in the source snapshot and the objectsin the destination and issuing replication of the unsynchronized objectsin the snapshot that require replication.

The procedure for execution of the snapshot replication job is herebydescribed by turning now to FIG. 4. FIG. 4 is a flowchart illustratingan exemplary method 400 for the execution of a snapshot replication job.The method 400 begins (step 402) by retrieving in an orderly fashion thenext object from the source snapshot (step 404). The method 400 willsend the object ID and the state ID of the next retrieved object to thetarget destination (step 406). The method 400 will determine if theobject ID exists in the target destination (step 408). If no, the method400 may open replication tasks to replicate the object data and metadata(step 412). If yes, the method 400 determines if the received state ID(e.g., received from the next selected object) is different from thecurrent state ID in the target destination (step 410). If yes, themethod 400 will open replication tasks to replicate the object data andmetadata (step 412). If no, the method 400 determines if the end of thesnapshot has been reached (step 414). If yes, the method 400 will waitfor all replication tasks to complete (step 416). If no, the method 400returns to step 404 and retrieves the next object from the sourcesnapshot (step 404). Returning now to step 412, upon completion ofopening replication tasks to replicate the object data and metadata, themethod 400 moves to step 414. Again, the method 400 determines if theend of the snapshot has been reached (step 414). If yes, the method 400will wait for all replication tasks to complete (step 416). If no, themethod 400 returns to step 404 and retrieves the next object from thesource snapshot (step 404). The method 400 ends (step 418).

Upon execution of the snapshot replication job, as described above inFIG. 4, the state of the objects included in the snapshot is comparedwith their current state in the destination. The mechanisms perform thecomparison on a lightweight representation of the objects (e.g. versionand/or hash value) and not on the full object data thereby enabling ascalable and efficient operation. The mechanisms discover thedestination objects that are not synchronized and update them accordingto the state in the source snapshot.

In one embodiment, snapshot replication mechanisms have special traits,which enable scalable and efficient user initiated replication in asynchronized replication system, satisfying the comprehensive set ofrequirements listed as follows. 1) The mechanisms allow the user toperform replication of a set of objects, independent of their actualsynchronization state. 2) The mechanisms efficiently detectunsynchronized objects by comparing their state in the destination withtheir state in the source snapshot. 3) The mechanisms of the presentinvention do not disrupt the local creation and manipulation of objectsas the mechanisms only create a snapshot of the state of the objects,using the efficient snapshot mechanism provided by the logical storagesystem. 4) The mechanisms do not compromise the normal replication orderof the source operations as snapshot is added to the replication asanother replication job. 5) The mechanisms allow for the user-initiatedreplication of a set of objects to be independent of the actualreplication procedures.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wired, optical fiber cable, RF, etc., or any suitable combination of theforegoing. Computer program code for carrying out operations for aspectsof the present invention may be written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Java, Smalltalk, C++ or the like and conventionalprocedural programming languages, such as the “C” programming languageor similar programming languages. The program code may execute entirelyon the user's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention have been described above withreference to flowchart illustrations and/or block diagrams of methods,apparatus (systems) and computer program products according toembodiments of the invention. It will be understood that each block ofthe flowchart illustrations and/or block diagrams, and combinations ofblocks in the flowchart illustrations and/or block diagrams, can beimplemented by computer program instructions. These computer programinstructions may be provided to a processor of a general purposecomputer, special purpose computer, or other programmable dataprocessing apparatus to produce a machine, such that the instructions,which execute via the processor of the computer or other programmabledata processing apparatus, create means for implementing thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks. The computer program instructions may also beloaded onto a computer, other programmable data processing apparatus, orother devices to cause a series of operational steps to be performed onthe computer, other programmable apparatus or other devices to produce acomputer implemented process such that the instructions which execute onthe computer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagrams in the above figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

While one or more embodiments of the present invention have beenillustrated in detail, the skilled artisan will appreciate thatmodifications and adaptations to those embodiments may be made withoutdeparting from the scope of the present invention as set forth in thefollowing claims.

What is claimed is:
 1. A system for user initiated replication in a synchronized object replication system in a computing environment, comprising: a processor device operable in the computing environment, wherein the processor device is adapted for: creating a snapshot of selected objects in a source repository in response to the user initiated replication, wherein the snapshot is designated as a snapshot replication job, detecting unsynchronized objects in a target destination by comparing a lightweight representative state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job, retrieving in an ordered manner at least one object of the selected objects from the snapshot, sending an object identification (ID) and a state ID of the at least one object to the target destination, searching for the object ID in the target destination, wherein if the object ID is located, the state ID of the at least one object is compared with a current state ID of the target destination, and if neither the object ID exists in the target destination and the state ID of the at least one object and the current state ID of the target destination do not match, replication tasks are opened for replicating data and metadata of the at least one object to the target destination.
 2. The system of claim 1, wherein the at least one processor device is further adapted for adding the snapshot replication job to an end of a replication queue to await execution for the synchronized object replication; and wherein the unsynchronized objects in the target destination are synchronized in an order they were added based upon the comparison of the lightweight representative state of the selected objects in the snapshot with the current state of the target destination at the time of execution of the snapshot replication job.
 3. The system of claim 1, wherein the at least one processor device is further adapted for performing one of: if an operation occurs prior to the creating, replicating the operation prior to replication the snapshot replication job, and if an operation occurs after the creating, replicating the operation after replicating the snapshot replication job.
 4. The system of claim 3, wherein the at least one processor device is further adapted for separating the operation into a data operation and a metadata operation, wherein the data operation is one of a write new data and deletion of old data, and the metadata operation is one of changing metadata of a node and changing a tree structure.
 5. The system of claim 1, wherein the at least one processor device is further adapted for, in conjunction with the comparison, traversing the snapshot by comparing at least one of a tree structure, data, and metadata of the snapshot with objects in the target destination.
 6. The system of claim 1, wherein the at least one processor device is further adapted for, in conjunction with the user initiated replication of the selected objects, replicating the selected objects independent of an actual synchronized state of the selected objects.
 7. The system of claim 1, wherein the at least one processor device is further adapted for, in conjunction with the user initiated replication of the selected objects, replicating the selected objects independent of at least one of a replication procedure, a protocol, a file system layout, and an implementation.
 8. A computer program product for user initiated replication in a synchronized object replication system in a computing environment using a processor device, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising: an executable portion for creating a snapshot of selected objects in a source repository in response to the user initiated replication, wherein the snapshot is designated as a snapshot replication job; an executable portion for detecting unsynchronized objects in a target destination by comparing a lightweight representative state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job; and an executable portion for performing each of: retrieving in an ordered manner at least one object of the selected objects from the snapshot; sending an object identification (ID) and a state ID of the at least one object to the target destination; searching for the object ID in the target destination, wherein if the object ID is located, the state ID of the at least one object is compared with a current state ID of the target destination; and if neither the object ID exists in the target destination and the state ID of the at least one object and the current state ID of the target destination do not match, replication tasks are opened for replicating data and metadata of the at least one object to the target destination.
 9. The computer program product of claim 8, further including an executable portion for adding the snapshot replication job to an end of a replication queue to await execution for the synchronized object replication; and wherein the unsynchronized objects in the target destination are synchronized in an order they were added based upon the comparison of the lightweight representative state of the selected objects in the snapshot with the current state of the target destination at the time of execution of the snapshot replication job.
 10. The computer program product of claim 8, further including an executable portion for, performing one of: if an operation occurs prior to the creating, replicating the operation prior to replication the snapshot replication job, and if an operation occurs after the creating, replicating the operation after replicating the snapshot replication job.
 11. The computer program product of claim 10, further including an executable portion for separating the operation into a data operation and a metadata operation, wherein the data operation is one of writing new data and deleting old data, and the metadata operation is one of changing metadata of a node and changing a tree structure.
 12. The computer program product of claim 8, further including an executable portion for, in conjunction with the comparison, traversing the snapshot by comparing at least one of a tree structure, data, and metadata of the snapshot with objects in the target destination.
 13. The computer program product of claim 8, further including an executable portion for, in conjunction with the user initiated replication of the selected objects, replicating the selected objects independent of an actual synchronized state of the selected objects.
 14. The computer program product of claim 8, further including an executable portion for, in conjunction with the user initiated replication of the selected objects, replicating the selected objects independent of at least one of a replication procedure, a protocol, a file system layout, and an implementation. 